An algorithm for convexity of semilinear sets over ordered fields
نویسندگان
چکیده
In this paper we study semilinear sets over arbitrary ordered fields. In particular we show that open (resp. closed) semilinear sets are convex if and only if they are basic, that is, a finite intersection of open (resp. closed) halfspaces. As a corollary we get that any bounded convex closed semilinear set is the convex hull of a finite family of points and we obtain a separation result for convex closed semilinear sets, both classical results over the real numbers. We recover the constructive proof of these results to get an algorithm for convexity of these sets. This algorithm is polynomial in the number of variables and basic pieces of the initial description; but it is exponential in the number of linear functions which describe the set. An implementation of this method was made in the Computer Algebra System Maple 6. We finish with some examples of this implementation.
منابع مشابه
Witt rings of quadratically presentable fields
This paper introduces an approach to the axiomatic theory of quadratic forms based on {tmem{presentable}} partially ordered sets, that is partially ordered sets subject to additional conditions which amount to a strong form of local presentability. It turns out that the classical notion of the Witt ring of symmetric bilinear forms over a field makes sense in the context of {tmem{quadratically p...
متن کاملConvex structures via convex $L$-subgroups of an $L$-ordered group
In this paper, we first characterize the convex $L$-subgroup of an $L$-ordered group by means of fourkinds of cut sets of an $L$-subset. Then we consider the homomorphic preimages and the product of convex $L$-subgroups.After that, we introduce an $L$-convex structure constructed by convex $L$-subgroups.Furthermore, the notion of the degree to which an $L$-subset of an $L$-ord...
متن کاملA full NT-step O(n) infeasible interior-point method for Cartesian P_*(k) –HLCP over symmetric cones using exponential convexity
In this paper, by using the exponential convexity property of a barrier function, we propose an infeasible interior-point method for Cartesian P_*(k) horizontal linear complementarity problem over symmetric cones. The method uses Nesterov and Todd full steps, and we prove that the proposed algorithm is well define. The iteration bound coincides with the currently best iteration bound for the Ca...
متن کاملGeneral definitions for the union and intersection of ordered fuzzy multisets
Since its original formulation, the theory of fuzzy sets has spawned a number of extensions where the role of membership values in the real unit interval $[0, 1]$ is handed over to more complex mathematical entities. Amongst the many existing extensions, two similar ones, the fuzzy multisets and the hesitant fuzzy sets, rely on collections of several distinct values to represent fuzzy membershi...
متن کاملOn p-semilinear transformations
In this paper, we introduce $p$-semilinear transformations for linear algebras over a field ${bf F}$ of positive characteristic $p$, discuss initially the elementary properties of $p$-semilinear transformations, make use of it to give some characterizations of linear algebras over a field ${bf F}$ of positive characteristic $p$. Moreover, we find a one-to-one correspondence between $p$-semiline...
متن کامل